一种新的WDM光网中的共享链路保护策略

研究了WDM光网中的链路保护问题.提出了一种新的共享链路保护策略--基于SRLG的共享链路保护策略(SRLG-SLP).SRLG(共享风险链路组)定义了对一条工作光通道分配保护资源时的资源可用性的约束.它规定任意两条有着同样故障风险或者说处于同一个SRLG的工作光通道不能利用同样的保护资源.另外,还提出了一种更加符合实际的单链路故障模型,其中链路故障间隔时间和链路故障保持时间被考虑作为两个独立的变量.基于该链路故障模型,通过大量的仿真试验,比较了专用链路保护(DLP)、共享链路保护(SLP)和提出的SRLG-SLP保护策略的资源利用率、保护效率以及业务中断率.结果显示,我们提出的SRLG-SLP在保护效率和业务中断率方面的保护性能远好于DLP和SLP,但会牺牲一些资源利用率.     

Windows CE.Net嵌入式操作系统本地化研究及实现

本文对嵌入式Windows CE.Net操作系统的主要体系结构进行剖析.研究设计出了维吾尔文本地化环境,利用资源编译器编译和反编译功能,构建了基于Windows CE.Net平台的维吾尔文图形用户界面资源库,实现Windows CE.Net的界面维文化和基于Windows CE.Net的应用程序的维文支持;开发了输入法程序,实现Windows CE.Net的维吾尔文字键盘输入和软键盘输入;通过编制维吾尔文字库,为Windows CE.Net平台下维吾尔文字的显示、打印提供了基础.     

A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a problem oriented point of view the computational results show that the approach is competitive with an existing Tabu Search algorithm with respect to both solution quality and computation times.     

A robust decentralized reputation management system for service selection

Reputation mechanism is a novel approach to automate QoS-aware service selection in service oriented computing. The reputation system collects ratings on QoS that consumers feedback and aggregates them to derive a reputation value, which can in turn assist other consumers in service selection in future. However, current approaches fail to combat the malicious ratings and hence the calculated reputation values can be biased severely or even manipulated. Moreover, the centralized management of rating data restricts its application to large open environment. In this paper, we present a robust decentralized reputation system which can resist various unfair ratings and manipulation behaviours. It can evolve and become more mature against malicious ratings with the system running continuously. At last, we experimentally verify the robustness of the proposed approach through a simulation study.     

基于G/S模式的空间信息云服务架构研究

针对多系统间的数据交换、共享问题,尤其在大数据时代,海量的数据增长给数据的管理带来的挑战,提出了一种基于G/S(General-Browser/ Service-Cloud,G/S)模式的空间信息云服务架构——面向数据的架构(Data Oriented Architecture,DOA)。以数据为核心,以数据标识为主线,通过数据注册中心和数据交换规范XXML(Specific Industry Markup Language),对海量异构数据进行存储、计算和管理,实现多系统间的数据共享、访问和协同。通过在地质灾害监测预警方面的应用,证明了该架构作为信息技术的系统构建方法在大数据时代独特的优势。     

基于云环境的分布式软件接口自动化测试

软件测试是保证软件质量,提供可靠服务的重要技术手段。目前基于Web Service的分布式软件越来越多,其测试技术手段也越来越受到关注。Web Service的分布性和多样性使手工测试变得非常低效,因而需要不断提高Web Service测试的自动化程度。另外,云计算因其计算成本低、可伸缩性强的特点为自动化测试提供了新的支持环境。本文结合Web Service的测试需求,首次提出了基于云环境的Web Service接口自动化测试的技术框架,分析了框架内原子Web Service、组合Web Service测试的关键技术,并研发了基于CloudStack云平台的自动化测试的原型系统。实验结果表明,本文所提出的基于云平台的WebService自动化测试方案可行且提高了测试效率。     

分段滤波用于消除脉搏血氧检测中多种运动干扰的研究

脉搏血氧饱和度检测仪可以无损、实时地检测动脉血液中的含氧百分比,从而快速对人体的呼吸状况以及心肺功能作出判断,但其检测精度极易受到测试部位运动的影响.人体测试部位的运动大致可以分为突发性运动干扰以及周期性的运动干扰.突发性干扰表现在局部脉搏波的波形突变上,而周期性的干扰体现在多个局部脉搏波的波形的周期性变化上.文章有针对性地提出了一种将微分阈值分段与迭带中值滤波相结合的方法来剔除突发扰动的方法,并且在上诉方法上再加上一级多点移动平滑以消除周期性运动干扰.实验证明该方法在消除多种运动伪差上有着较好的效果,且该方法计算简单,易于实现,有着一定的实际应用价值.     

Applications of SMP Bounds to Multi-class Traffic in High-speed Networks

In this paper, we consider the stochastic fluid-flow model of a single node in a high-speed telecommunication network handling multi-class traffic. The node has multiple buffers, one for each class of traffic. The contents of these buffers are multiplexed onto a single output channel using one of the service scheduling policies: the Timed Round Robin Policy or the Static Priority Service Policy. The Quality of Service requirements for each class are based on cell loss probabilities. Using effective bandwidth methodologies and the recently developed bounds for semi-Markov modulated traffic, we solve call admission control problems for the two service scheduling policies at this node. We compare the performance of the effective bandwidth methodologies and the SMP bounds technique. We also numerically compare the performance of the two service scheduling policies.